Algebraicity and Implicit Definability in Set Theory

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Definability in Logic and Rough Set Theory

Rough set theory is an effective tool for data mining. According to the theory, a concept is definable if it can be written as a Boolean combination of equivalence classes induced from classification attributes. On the other hand, definability in logic has been explicated by Beth’s theorem. In this paper, we propose two data representation formalisms, called first-order data logic (FODL) and at...

متن کامل

Implicit Definability in Arithmetic

We consider implicit definability over the natural number system N,+,×,=. We present a new proof of two theorems of Leo Harrington. The first theorem says that there exist implicitly definable subsets of N which are not explicitly definable from each other. The second theorem says that there exists a subset of N which is not implicitly definable but belongs to a countable, explicitly definable ...

متن کامل

Definability and global degree theory

Gödel’s work [Gö34] on undecidable theories and the subsequent formalisations of the notion of a recursive function ([Tu36], [Kl36] etc.) have led to an ever deepening understanding of the nature of the non-computable universe (which as Gödel himself showed, includes sets and functions of everyday significance). The nontrivial aspect of Church’s Thesis (any function not contained within one of ...

متن کامل

FUZZY SOFT SET THEORY AND ITS APPLICATIONS

In this work, we define a fuzzy soft set theory and its related properties. We then define fuzzy soft aggregation operator that allows constructing more efficient decision making method. Finally, we give an example which shows that the method can be successfully applied to many problems that contain uncertainties.

متن کامل

Implicit definability of truth constants in Łukasiewicz logic

In the framework of propositional Lukasiewicz logic, a suitable notion of implicit definability, tailored to the intended real-valued semantics and referring to the elements of its domain, is introduced. Several variants of implicitly defining each of the rational elements in the standard semantics are explored, and based on that, a faithful interpretation of theories in Rational Pavelka logic ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 2016

ISSN: 0029-4527

DOI: 10.1215/00294527-3542326